Search Parameters for the Small World Problem

نویسنده

  • Harrison C. White
چکیده

In "small world" studies successive men each send on a postcard packet to an acquaintance who may know a designated target person on a first-name basis. In this analysis the likelihood of discarding the packet is separated from the chance the packet if sent reaches a man who knows the target. The former probability is assumed to be independent of the previous number of persons in the chain. The assumption is satisfied by the three extant sets of aggregate data. Then the latter probability is found to rise from zero to a modest plateau with the number of steps in the chain. Refinements and variants of the model are suggested. Funneling of chains through a few persons near the target is discussed. Social processes shape and are shaped by 1966). Snowballing effects however make it networks of particular ties linking individvery difficult to trace networks through many uals in populations. Even in the field of links; so the long-range structure and intermass media Katz and Lazarsfeld (1955) 1oi:g locking of such networks in large population~ ago emphasized this truth as a balance to remains unclear. Rapoport and Horvath conventional pictures of attitudes being broad(1961) extended classical sociometry to larger cast direct to categories of people. Studies of groups and provide some insight into condiffusion-of rumors, fads, disease, or innonectivity properties. A second empirical apvations-were a natural first approach to the proach to networks has focused on how links empirical study of networks (Coleman et al., of different affective quality tend to fit together in balanced groupings among small sets af * Stanley Milgram suggested this analysis and I people (e.g., Bott, 1957; White, 1961)am indebted to him, Jeff Travers and Charles again the overall topology of networks remains Korte for explainhi their ideas and data. Financial support was received from ?he National obscure, although ties are made between netScience Foundation under Grant GS-448. work study and classical ideas of role theory.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New model for integrated lot sizing and scheduling in flexible job shop problem

In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...

متن کامل

A Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm

The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...

متن کامل

The P-Center Problem under Uncertainty

Facility location decisions play a prominent role in strategic planning of many firms, companies and governmental organizations. Since in many real-world facility location problems, the data are subject to uncertainty, in this paper, we consider the P-center problem under uncertainty of demands. Using Bertsimas and Sim approach, we develop a robust model of the problem as an integer programming...

متن کامل

The P-Center Problem under Uncertainty

Facility location decisions play a prominent role in strategic planning of many firms, companies and governmental organizations. Since in many real-world facility location problems, the data are subject to uncertainty, in this paper, we consider the P-center problem under uncertainty of demands. Using Bertsimas and Sim approach, we develop a robust model of the problem as an integer programming...

متن کامل

APPLICATION OF TABU SEARCH FOR SOLVING THE BI-OBJECTIVE WAREHOUSE PROBLEM IN A FUZZY ENVIRONMENT

The bi-objective warehouse problem in a crisp environment is often not eective in dealing with the imprecision or vagueness in the values of the problem parameters. To deal with such situations, several researchers have proposed that the parameters be represented as fuzzy numbers. We describe a new algorithm for fuzzy bi-objective warehouse problem using a ranking function followed by an applic...

متن کامل

A Tabu Search Method for a New Bi-Objective Open Shop Scheduling Problem by a Fuzzy Multi-Objective Decision Making Approach (RESEARCH NOTE)

This paper proposes a novel, bi-objective mixed-integer mathematical programming for an open shop scheduling problem (OSSP) that minimizes the mean tardiness and the mean completion time. To obtain the efficient (Pareto-optimal) solutions, a fuzzy multi-objective decision making (fuzzy MODM) approach is applied. By the use of this approach, the related auxiliary single objective formulation can...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007